Equivalence and Lumpability of FSPNs

نویسندگان

  • Falko Bause
  • Peter Buchholz
  • Igor V. Tarasyuk
  • Miklós Telek
چکیده

We consider equivalence relations for Fluid Stochastic Petri Nets (FSPNs). Based on equivalence relations for Stochastic Petri Nets (SPNs), which are derived from lumpability for Markov Chains, and from lumpability for certain classes of differential equations, we define an equivalence relation for FSPNs. Lumpability for the differential equations is based on a finite discretization approach and permutations of the fluid part of the FSPN. As for other modeling formalisms, the availability of an appropriate equivalence relation allows one to aggregate sets of equivalent states into single states. This state space reduction can be exploited for a more efficient analysis of FSPNs using a discretization approach. Lumpable equivalence relations can be computed from an appropriately discretized state space of the stochastic process or directly from the FSPN.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Applied Probability Trust (14 August 2011) RATIONAL PROCESSES RELATED TO COMMUNICATING MARKOV PROCESSES

A class of stochastic processes, denoted as marked rational arrival processes (MRAPs), is defined which is an extension of matrix exponential distributions and rational arrival processes. Continuous time Markov processes with labeled transitions are a subclass of this more general model class. New equivalence relations between processes are defined and it is shown that these equivalence relatio...

متن کامل

Exact Fluid Lumpability for Chemical Reaction Networks

We present a technique for the automatic reduction of chemical reaction networks (CRNs). We study exact fluid lumpability, a partition of species satisfying the dynamical property that species in the same block have the same output at all times if initialized equally. Inspired by analogous approaches in traditional models of computation such as labelled transition systems, we characterize this ...

متن کامل

Contextual lumpability

Quantitative analysis of computer systems is often based on Markovian models. Among the formalisms that are used in practice, Markovian process algebras have found many applications, also thanks to their compositional nature that allows one to specify systems as interacting individual automata that carry out actions. Nevertheless, as with all state-based modelling techniques, Markovian process ...

متن کامل

Exact Fluid Lumpability for Markovian Process Algebra

We study behavioural relations for process algebra with a fluid semantics given in terms of a system of ordinary differential equations (ODEs). We introduce label equivalence, a relation which is shown to induce an exactly lumped fluid model, a potentially smaller ODE system which can be exactly related to the original one. We show that, in general, for two processes that are related in the flu...

متن کامل

A geometric invariant in weak lumpability of finite Markov chains

We consider weak lumpability of finite homogeneous Markov chains, that is when a lumped Markov chain with respect to a partition of the initial state space is also a homogeneous Markov chain. We show that weak lumpability is equivalent to the existence of a direct sum of polyhedral cones which is is positively invariant by the transition probability matrix of the original chain. It allows us, i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017